Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
نویسندگان
چکیده
منابع مشابه
REALIZABILITY OF p-POINT GRAPHS WITH PRESCRIBED - DEGREE, MAXIMUM DEGREE, AND POlNT4ZONNE-
In a recent paper, we gave a generalization of extremal problems involving certain graphtheoretic invariants. In that work, we defined a (p, A, 8, A) graph as a graph having p points, maximum degree A, minimum degree 6, and line-connectivity A. An arbitrary quadruple of integers (a, b, c, d) was called (p, A, & A) realizable if there is a (p, A, 8, A) graph with p = a, A = b, 8 = c, and A = d. ...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملLong cycles in graphs with prescribed toughness and minimum degree
A cycle C of a graph G is a D~-cycle if every component of G V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2 2 for some 2 ~< t + 1, then G contains a Dx-cycle. In particular, if 6>n/(t+ 1)--1, then G is ham...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1981
ISSN: 0166-218X
DOI: 10.1016/0166-218x(81)90023-8